Network Coding-Based Post-Quantum Cryptography

We propose a novel hybrid universal network-coding cryptosystem (HUNCC) to obtain secure post-quantum cryptography at high communication rates. The scheme we offer is in the sense that it combines information-theoretic security with public-key cryptography. In addition, general and can be applied any network, cryptosystem. Our based on information theoretic notion of individual secrecy, which traditionally relies assumption an eavesdropper only observe subset links between trusted parties - often challenging enforce. For this setting, several code constructions have been developed, where messages are linearly mixed before transmission over each paths way guarantees adversary observes has sufficient uncertainty about message. Instead, article, take computational viewpoint, construct coding arbitrary utilized links, while pre-processing similar one utilized. Under scheme, demonstrate 1) guarantee for entirety 2) 3) rates approach capacity network greatly improve upon current solutions. A perhaps surprising consequence our that, level b, encrypt single link using scheme. That is, HUNCC, ensure networks not possible use encryption all network. rate approaches 1 as number increases. As concrete example, multipath three 128-bit computationally McEliece link, individually total 0.91